Self-Adaptation in Evolutionary Algorithms

نویسندگان

  • Silja Meyer-Nieberg
  • Hans-Georg Beyer
چکیده

In this chapter, we will give an overview over self-adaptive methods in evolutionary algorithms. Self-adaptation in its purest meaning is a state-of-the-art method to adjust the setting of control parameters. It is called self-adaptive because the algorithm controls the setting of these parameters itself – embedding them into an individual’s genome and evolving them. We will start with a short history of adaptation methods. The section is followed by a presentation of classification schemes for adaptation rules. Afterwards, we will review empirical and theoretical research of self-adaptation methods applied in genetic algorithms, evolutionary programming, and evolution strategies.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of sediment rating curve coefficients using evolutionary algorithms and unsupervised artificial neural network

Sediment rating curve (SRC) is a conventional and a common regression model in estimating suspended sediment load (SSL) of flow discharge. However, in most cases the data log-transformation in SRC models causing a bias which underestimates SSL prediction. In this study, using the daily stream flow and suspended sediment load data from Shalman hydrometric station on Shalmanroud River, Guilan Pro...

متن کامل

Gradient-based Ant Colony Optimization for Continuous Spaces

A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...

متن کامل

Gradient-based Ant Colony Optimization for Continuous Spaces

A novel version of Ant Colony Optimization (ACO) algorithms for solving continuous space problems is presented in this paper. The basic structure and concepts of the originally reported ACO are preserved and adaptation of the algorithm to the case of continuous space is implemented within the general framework. The stigmergic communication is simulated through considering certain direction vect...

متن کامل

Step Length Adaptation on Ridge Functions

Step length adaptation is central to evolutionary algorithms in real-valued search spaces. This paper contrasts several step length adaptation algorithms for evolution strategies on a family of ridge functions. The algorithms considered are cumulative step length adaptation, a variant of mutative self-adaptation, two-point adaptation, and hierarchically organized strategies. In all cases, analy...

متن کامل

Competitive Self-adaptation in Evolutionary Algorithms

Heuristic search for the global minimum is studied. This paper is focused on the adaptation of control parameters in differential evolution (DE) and in controlled random search (CRS). The competition of different control parameter settings is used in order to ensure the self-adaptation of parameter values within the search process. In the generalized CRS the self-adaptation is ensured by severa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007